Projections onto the Pareto surface in multicriteria radiation therapy optimization.
نویسندگان
چکیده
PURPOSE To eliminate or reduce the error to Pareto optimality that arises in Pareto surface navigation when the Pareto surface is approximated by a small number of plans. METHODS The authors propose to project the navigated plan onto the Pareto surface as a postprocessing step to the navigation. The projection attempts to find a Pareto optimal plan that is at least as good as or better than the initial navigated plan with respect to all objective functions. An augmented form of projection is also suggested where dose-volume histogram constraints are used to prevent that the projection causes a violation of some clinical goal. The projections were evaluated with respect to planning for intensity modulated radiation therapy delivered by step-and-shoot and sliding window and spot-scanned intensity modulated proton therapy. Retrospective plans were generated for a prostate and a head and neck case. RESULTS The projections led to improved dose conformity and better sparing of organs at risk (OARs) for all three delivery techniques and both patient cases. The mean dose to OARs decreased by 3.1 Gy on average for the unconstrained form of the projection and by 2.0 Gy on average when dose-volume histogram constraints were used. No consistent improvements in target homogeneity were observed. CONCLUSIONS There are situations when Pareto navigation leaves room for improvement in OAR sparing and dose conformity, for example, if the approximation of the Pareto surface is coarse or the problem formulation has too permissive constraints. A projection onto the Pareto surface can identify an inaccurate Pareto surface representation and, if necessary, improve the quality of the navigated plan.
منابع مشابه
A Dual Algorithm for Approximating Pareto Sets in Convex Multi-criteria Optimization
We consider the problem of approximating the Pareto set of convex multicriteria optimization problems by a discrete set of points and their convex combinations. Finding the scalarization parameters that maximize the improvement in bound on the approximation error when generating a single Pareto optimal solution is a nonconvex optimization problem. This problem is solvable by enumerative techniq...
متن کاملOn Robust Optimization - Relations Between Scalar Robust Optimization and Unconstrained Multicriteria Optimization
We introduce an unconstrained multicriteria optimization problem and discuss its relation to various well-known scalar robust optimization problems with a finite uncertainty set. Specifically, we show that a unique solution of a robust optimization problem is Pareto optimal for the unconstrained optimization problem. Furthermore, it is demonstrated that the set of weakly Pareto optimal solution...
متن کاملCompromise Solutions in Multicriteria Combinatorial Optimization
In multicriteria optimization, a compromise solution is a feasible solution whose cost vector minimizes the distance to the ideal point w.r.t. a given norm. The coordinates of the ideal point are given by the optimal values for the single optimization problem for each criterion. We show that the concept of compromise solutions fits nicely into the existing notion of Pareto optimality: For a hug...
متن کاملGenerating Uniformly Distributed Pareto Optimal Points for Constrained and Unconstrained Multicriteria Optimization
This paper proposes a novel approach to generate a uniform distribution of the optimal solutions along the Pareto frontier. We make use of a standard mathematical technique for optimization namely line search and adapt it so that it will be able to generate a set of solutions uniform distributed along the Pareto front. To validate the method, numerical bi-criteria examples are considered. The m...
متن کاملGeneralized Multicriteria Location Problems
This work concerns a special class of multicriteria optimization problems, obtained from a given single-facility multicriteria planar location problem by adding several new cost functions. By means of a decomposition approach, based on the concept of Pareto reducibility, we have developed together with S. Alzorba and Chr. Günther an implementable algorithm for generating efficient solutions of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Medical physics
دوره 42 10 شماره
صفحات -
تاریخ انتشار 2015